Exact algorithm for graph homomorphism and locally injective graph homomorphism
نویسندگان
چکیده
منابع مشابه
Exact Algorithm for Graph Homomorphism and Locally Injective Graph Homomorphism
For graphs G and H , a homomorphism from G to H is a function φ : V (G) → V (H), which maps vertices adjacent in G to adjacent vertices of H . A homomorphism is locally injective if no two vertices with a common neighbor are mapped to a single vertex in H . Many cases of graph homomorphism and locally injective graph homomorphism are NPcomplete, so there is little hope to design polynomial-time...
متن کاملGraph Homomorphism Revisited for Graph Matching
In a variety of emerging applications one needs to decide whethera graph G matches another Gp, i.e., whether G has a topologicalstructure similar to that of Gp. The traditional notions of graphhomomorphism and isomorphism often fall short of capturing thestructural similarity in these applications. This paper studies revisions of these notions, providing a full treatment from co...
متن کاملDual graph homomorphism functions
For any two graphs F and G, let hom(F,G) denote the number of homomorphisms F → G, that is, adjacency preserving maps V (F ) → V (G) (graphs may have loops but no multiple edges). We characterize Institute of Mathematics, Eötvös Loránd University, Budapest, Hungary. Email: [email protected]. Research sponsored by OTKA Grant No. 67867. CWI and University of Amsterdam, Amsterdam, The Netherlands....
متن کاملExtending graph homomorphism and simulation for real life graph matching
Among the vital problems in a variety of emerging applications is the graph matching problem, which is to determine whether two graphs are similar, and if so, find all the valid matches in one graph for the other, based on specified metrics. Traditional graph matching approaches are mostly based on graph homomorphism and isomorphism, falling short of capturing both structural and semantic simil...
متن کاملLocally Injective Homomorphism to the Simple Weight Graphs
A Weight graph is a connected (multi)graph with two vertices u and v of degree at least three and other vertices of degree two. Moreover, if any of these two vertices is removed, the remaining graph contains a cycle. A Weight graph is called simple if the degree of u and v is three. We show full computational complexity characterization of the problem of deciding the existence of a locally inje...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information Processing Letters
سال: 2014
ISSN: 0020-0190
DOI: 10.1016/j.ipl.2014.02.012